Efficient algorithms for polynomial interpolation and numerical differentiation
نویسندگان
چکیده
منابع مشابه
Efficient SIMD Numerical Interpolation
This paper reports the results of SIMD implementation of a number of interpolation algorithms on common personal computers. These methods fit a curve on some given input points for which a mathematical function form is not known. We have implemented four widely used methods using vector processing capabilities embedded in Pentium processors. By using SSE (streaming SIMD extension) we could perf...
متن کاملNew Iterative Methods for Interpolation, Numerical Differentiation and Numerical Integration
Through introducing a new iterative formula for divided difference using Neville's and Aitken's algorithms, we study new iterative methods for interpolation, numerical differentiation and numerical integration formulas with arbitrary order of accuracy for evenly or unevenly spaced data. Basic computer algorithms for new methods are given.
متن کاملProbabilistically Stable Numerical Sparse Polynomial Interpolation
We consider the problem of sparse interpolation of a multivariate black-box polynomial in floating-point arithmetic. That is, both the inputs and outputs of the black-box polynomial have some error, and all values are represented in standard, fixed-precision, floating-point arithmetic. By interpolating the black box evaluated at random primitive roots of unity, we give an efficient and numerica...
متن کاملImproved Sparse Multivariate Polynomial Interpolation Algorithms
We consider the problem of interpolating sparse multivariate polynomials from their values. We discuss two algorithms for sparse interpolation, one due to Ben-Or and Tiwari (1988) and the other due to Zippel (1988). We present efficient algorithms for finding the rank of certain special Toeplitz systems arising in the Ben-Or and Tiwari algorithm and for solving transposed Vandermonde systems of...
متن کاملNumerical Polynomial Algebra: Concepts and Algorithms
In this expository lecture, we explain how problems of classical polynomial algebra may be understood and numerically solved when they appear in the context of Scientific Computing, i.e. with data of limited accuracy. A suitable conceptual framework is introduced and its use explained in a number of situations.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1970
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-1970-0258240-x